Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
341	CCCG 2011, Toronto ON, August 10–12, 2011 Computing k-Link Visibility Polygons in Environments with a Reflective Edge Salma S. Mahdavi ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Visibility polygon Art gallery problem Polygon Shading Vertex Area Computational geometry Star-shaped polygon Polygon triangulation Geometry Polygons Simple polygon
342	INFORMS INTERFACES Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn \| eissn 1526-551X \| 00 \| 0000 \| 0001 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-11-21 02:25:22 Operations research Mathematical optimization Convex optimization Internet marketing Advertising Linear programming Television advertisement Pay per click Knapsack problem Theoretical computer science Applied mathematics Computational complexity theory
343	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard Extended Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:37 Applied mathematics Optical devices Network theory NP Shortest path problem Beam splitter Theoretical computer science Computational complexity theory Complexity classes
344	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
345	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
346	Adaptive Informative Path Planning in Metric Spaces Zhan Wei Lim, David Hsu, and Wee Sun Lee National University of Singapore, Singapore, Singapore Abstract. In contrast to classic robot motion planning, informati Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-16 20:39:51 Operations research Approximation algorithm Computational complexity theory Travelling salesman problem Algorithm XTR Theoretical computer science Mathematics Applied mathematics
347	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 VC-Dimension of Visibility on Terrains James King∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:09:07 Polygons Mathematics Art gallery problem VC dimension Simple polygon Area Applied mathematics Computational geometry Computational learning theory Geometry
348	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
349	16th Canadian Conference on Computational Geometry, 2004 The Fitting Line Problem in the Laguerre Geometry Sergey Bereg Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Analytic geometry Elementary geometry Linear algebra Abstract algebra Differential geometry Circle Inversive geometry Line Vector space Geometry Algebra Mathematics
350	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems

UPDATE